Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints
نویسندگان
چکیده
The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of scheduling jobs with chain precedence constraints on a fixed number of uniformly related machines. Our algorithm works even if we allow “slow” machines to remain idle.
منابع مشابه
SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملUet-scheduling with Chain-type Precedence Constraints Uet|scheduling with Chain-type Precedence Constraints
x{ Scope and Purpose. | We consider a scheduling problem in a two-processor system where (i) every job can be processed on only one machine and where (ii) there are chain-type precedence relations among the jobs. The goal is to minimize the makespan. This continues the work of Chang and Lee 1], Jansen 4] and of Kellerer and Woeginger 5]. Abstract. | We consider a special case of the precedence ...
متن کاملApproximation Algorithms for Stochastic Machine Scheduling with Precedence Constraints
We consider parallel, identical machine scheduling problems where the jobs are subject to precedence constraints, release dates, and the processing times of jobs are governed by independent probability distributions. The objective is to minimize the expected value of the total weighted completion time ∑w j C j , where w j 0. Building upon a linear programming relaxation by Möhring, Schulz, and ...
متن کامل